<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>SSDP Help: D:/doxy/PublicAPI/ATEC/atstd/bc___rb_tree.h 源文件</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">SSDP Help<span id="projectnumber">&#160;2.04.01</span>
   </div>
   <div id="projectbrief">仅供测试</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.9.3 -->
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('../../',false,false,'search.php','搜索');
});
/* @license-end */
</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="../../dir_52a01df1794e5beec01860bdd05aea48.html">PublicAPI</a></li><li class="navelem"><a class="el" href="../../dir_61153f54a0892efe919342a84eb61844.html">ATEC</a></li><li class="navelem"><a class="el" href="../../dir_11e5a7616ba6bb5a862d03f24cf79fa9.html">atstd</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">bc___rb_tree.h</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*--------------------------------------------------------------------------------------+</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">|</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">|     $Source: PublicAPI/ATEC/stdcxx/rw/bc___rb_tree.h $</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">|</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">|  $Copyright: (c) 2019 SZEWEC Systems, Incorporated. All rights reserved. $</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">|</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">+--------------------------------------------------------------------------------------*/</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#pragma once</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">//__PUBLISH_SECTION_START__</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"></span> </div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">/***************************************************************************</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * _tree.h - Declarations for the Standard Library tree classes</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> *</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * This is an internal header file used to implement the C++ Standard</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * Library. It should never be #included directly by a program.</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> *</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * $Id: _tree.h 681820 2008-08-01 20:51:17Z vitek $</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> *</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> ***************************************************************************</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> *</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * Licensed to the Apache Software  Foundation (ASF) under one or more</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * contributor  license agreements.  See  the NOTICE  file distributed</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * with  this  work  for  additional information  regarding  copyright</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * ownership.   The ASF  licenses this  file to  you under  the Apache</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * License, Version  2.0 (the  &quot;License&quot;); you may  not use  this file</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * except in  compliance with the License.   You may obtain  a copy of</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * the License at</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> *</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> *</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> * Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment"> * distributed under the  License is distributed on an  &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"> * WITHOUT  WARRANTIES OR CONDITIONS  OF ANY  KIND, either  express or</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> * implied.   See  the License  for  the  specific language  governing</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> * permissions and limitations under the License.</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> *</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> * Copyright 1994-2006 Rogue Wave Software.</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment"> * </span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment"> ***************************************************************************</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"> *</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment"> * Copyright (c) 1994</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> * Hewlett-Packard Company</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"> *</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> * provided that the above copyright notice appear in all copies and</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> * that both that copyright notice and this permission notice appear</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> * in supporting documentation.  Hewlett-Packard Company makes no</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment"> * representations about the suitability of this software for any</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"> * purpose.  It is provided &quot;as is&quot; without express or implied warranty.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment"> *</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment"> **************************************************************************</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment"> *</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"> * NOTICE: This File contains modifications made by ATEC Systems Inc. where designated.</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment"> *</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment"> *************************************************************************/</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">/***************************************************************************</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment"> *</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment"> * Red-black tree class, designed for use in implementing associative</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment"> * containers (set, multiset, map, and multimap). The insertion and</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment"> * deletion algorithms are based on those in Cormen, Leiserson, and</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment"> * Rivest, Introduction to Algorithms (MIT Press, 1990), except that:</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment"> * </span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment"> * (1) the header cell is maintained with links not only to the root</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment"> * but also to the leftmost node of the tree, to enable constant time</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment"> * begin(), and to the rightmost node of the tree, to enable linear time</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment"> * performance when used with the generic set algorithms (set_union,</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment"> * etc.);</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment"> * </span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment"> * (2) when a node being deleted has two children its successor node</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment"> * is relinked into its place, rather than copied, so that the only</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment"> * iterators invalidated are those referring to the deleted node.</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment"> *</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment"> **************************************************************************/</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="preprocessor">#ifndef _RWSTD_RW_TREE_H_INCLUDED</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="preprocessor">#define _RWSTD_RW_TREE_H_INCLUDED</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment">// ATEC_CHANGE</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="preprocessor">#ifndef _RWSTD_RW_ITERATOR_H_INCLUDED</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="preprocessor">#  include &quot;_iterbase.h&quot;</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_RW_ITERATOR_H_INCLUDED</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>BC__RWSTD_NAMESPACE (BC__RW) { </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Alloc, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _Key, <span class="keyword">class</span> _KeyOf&gt;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="keyword">struct  </span>bc___rw_rb_tree_node</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>{</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keyword">enum</span> _C_color_t { _C_red, _C_black };</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keyword">typedef</span> _Val&amp;                                          reference;</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keyword">typedef</span> _Alloc                                         allocator_type;</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keyword">typedef</span> _RWSTD_REBIND (allocator_type,  bc___rw_rb_tree_node) _C_node_alloc_t;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keyword">typedef</span> _RWSTD_REBIND (allocator_type, _Key)              _C_key_alloc_t;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_alloc_t::pointer             _C_link_t;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_key_alloc_t::const_reference      _C_const_key_ref;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    _C_color_t _C_color; </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    _C_link_t  _C_parent;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// ATEC_CHANGE</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// Tthe array of 2 items does not work with Visual Studio visualizers for xmap, xset.  It needs left and right pointers.</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// _C_link_t  _C_child [2];   // left (0) and right (1) children</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keyword">union</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        {</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        _C_link_t _C_child[1];   <span class="comment">// left (0) and right (1) children</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        _C_link_t _C_child_left;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        };</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    _C_link_t _C_child_right;</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// ATEC_CHANGE end</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    _Val       _C_value;</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keyword">static</span> _C_link_t _C_minmax (_C_link_t __lnk, <span class="keywordtype">bool</span> __do_max) {</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        _RWSTD_ASSERT (_C_link_t () != __lnk);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">while</span> (_C_link_t () != __lnk-&gt;_C_child [__do_max])</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            __lnk = __lnk-&gt;_C_child [__do_max];</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">return</span> __lnk;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keyword">static</span> _C_link_t _C_min (_C_link_t __lnk) {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="keywordflow">return</span> _C_minmax (__lnk, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keyword">static</span> _C_link_t _C_max (_C_link_t __lnk) {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">return</span> _C_minmax (__lnk, <span class="keyword">true</span>);</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    _C_const_key_ref _C_key ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">return</span> _KeyOf ()(_C_value);</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>};</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment">// iterator implements inorder traversal; i.e., nodes are visited</span></div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">// recursively in this order: left suxtree, root, right suxtree</span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="keyword">template</span> &lt;<span class="keyword">class </span>_TypeT, <span class="keyword">class </span>_DiffT,</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>          <span class="keyword">class </span>_Pointer, <span class="keyword">class </span>_Ref, <span class="keyword">class </span>_Node&gt;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="keyword">class </span>bc___rw_tree_iter</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    : <span class="keyword">public</span> std::iterator &lt;std::bidirectional_iterator_tag,</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                            _TypeT, _DiffT, _Pointer, _Ref&gt;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>{</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keyword">typedef</span> std::iterator &lt;std::bidirectional_iterator_tag,</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                           _TypeT, _DiffT, _Pointer, _Ref&gt; _C_iter_base;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_iter_base::value_type        value_type;</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_iter_base::difference_type   difference_type;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_iter_base::pointer           pointer;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_iter_base::reference         reference;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_iter_base::iterator_category iterator_category;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keyword">typedef</span> _Node                                     _C_node_t;</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_t::allocator_type       allocator_type;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_t::_C_link_t            _C_link_t;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keyword">typedef</span> <span class="keyword">const</span> value_type*                         const_pointer; </div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="keyword">typedef</span> <span class="keyword">const</span> value_type&amp;                         const_reference; </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keyword">typedef</span> bc___rw_tree_iter&lt;_TypeT, _DiffT, value_type*, value_type&amp;, _C_node_t&gt;</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    _C_iterator;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    _C_link_t _C_node;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    bc___rw_tree_iter () { <span class="comment">/* empty */</span> }</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="comment">// no copy ctor other than the one below is defined</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="comment">// will use a compiler generated one if bc___rw_tree_iter != _C_iterator</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    bc___rw_tree_iter (<span class="keyword">const</span> _C_iterator &amp;__rhs)</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        : _C_node (__rhs._C_node) { }</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> _Ptr, <span class="keyword">class</span> _Ref&gt;</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    bc___rw_tree_iter (<span class="keyword">const</span> bc___rw_tree_iter&lt;_TypeT, _DiffT, _Ptr, _Ref, _Node&gt;&amp;</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>                    __rhs)</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        : _C_node (__rhs._C_node) { }</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    bc___rw_tree_iter (_C_link_t __lnk)</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        : _C_node (__lnk) {}        </div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="preprocessor">#ifdef SNI</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    difference_type operator- (<span class="keyword">const</span> bc___rw_tree_iter&amp;)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    }</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    </div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    bc___rw_tree_iter&amp; operator++ () {</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keywordflow">if</span> (_C_link_t () != _C_node-&gt;_C_child [1]) {</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>            _C_node = _C_node_t::_C_min (_C_node-&gt;_C_child [1]);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        }</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>            _C_link_t __tmp = _C_node-&gt;_C_parent;</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            <span class="keywordflow">while</span> (_C_node == __tmp-&gt;_C_child [1]) {</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>                _C_node = __tmp;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>                __tmp     = __tmp-&gt;_C_parent;</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>            }</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            <span class="keywordflow">if</span> (_C_node-&gt;_C_child [1] != __tmp)</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>                _C_node = __tmp;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        }</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    }</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    bc___rw_tree_iter&amp; operator-- () {</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        <span class="keywordflow">if</span> (   _C_node-&gt;_C_color == _C_node_t::_C_red</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            &amp;&amp; _C_node-&gt;_C_parent-&gt;_C_parent == _C_node)  </div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>            <span class="comment">//</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>            <span class="comment">// Check for header.</span></div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>            <span class="comment">//</span></div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            _C_node = _C_node-&gt;_C_child [1];   <span class="comment">// Return rightmost.</span></div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_C_link_t () != _C_node-&gt;_C_child [0]) {</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            _C_node = _C_node_t::_C_max (_C_node-&gt;_C_child [0]);</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        }</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            _C_link_t __tmp = _C_node-&gt;_C_parent;</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>            <span class="keywordflow">while</span> (_C_node == __tmp-&gt;_C_child [0]) {</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>                _C_node = __tmp;</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>                __tmp     = __tmp-&gt;_C_parent;</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            }</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>            _C_node = __tmp;</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        }</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    }</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    bc___rw_tree_iter operator++ (<span class="keywordtype">int</span>) {</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        bc___rw_tree_iter __tmp (*<span class="keyword">this</span>);</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <span class="keywordflow">return</span> ++*<span class="keyword">this</span>, __tmp;</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    </div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    bc___rw_tree_iter operator-- (<span class="keywordtype">int</span>) {</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        bc___rw_tree_iter __tmp (*<span class="keyword">this</span>);</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <span class="keywordflow">return</span> --*<span class="keyword">this</span>, __tmp;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    reference operator* ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">return</span> _C_node-&gt;_C_value;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    _RWSTD_OPERATOR_ARROW (pointer operator-&gt; () <span class="keyword">const</span>);</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>};</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="preprocessor">#define _RWSTD_TREE_ITER(n) \</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="preprocessor">        bc___rw_tree_iter &lt;_TypeT, _DiffT, _Ptr##n, _Ref##n, _Node&gt;</span></div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="keyword">template</span> &lt;<span class="keyword">class </span>_TypeT, <span class="keyword">class </span>_DiffT,</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>          <span class="keyword">class </span>_Ptr1, <span class="keyword">class </span>_Ref1, <span class="keyword">class </span>_Ptr2, <span class="keyword">class </span>_Ref2, <span class="keyword">class </span>_Node&gt;</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>operator== (<span class="keyword">const</span> _RWSTD_TREE_ITER (1) &amp;__lhs,</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            <span class="keyword">const</span> _RWSTD_TREE_ITER (2) &amp;__rhs)</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>{</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="keywordflow">return</span> __lhs._C_node == __rhs._C_node;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>}</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="keyword">template</span> &lt;<span class="keyword">class </span>_TypeT, <span class="keyword">class </span>_DiffT,</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>          <span class="keyword">class </span>_Ptr1, <span class="keyword">class </span>_Ref1, <span class="keyword">class </span>_Ptr2, <span class="keyword">class </span>_Ref2, <span class="keyword">class </span>_Node&gt;</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>operator!= (<span class="keyword">const</span> _RWSTD_TREE_ITER (1) &amp;__lhs,</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            <span class="keyword">const</span> _RWSTD_TREE_ITER (2) &amp;__rhs)</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>{</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    <span class="keywordflow">return</span> !(__lhs == __rhs);</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>}</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="preprocessor">#undef _RWSTD_TREE_ITER</span></div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span> </div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span><span class="comment">// for convenience</span></div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="preprocessor">#undef _ITER_NODE</span></div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="preprocessor">#define _ITER_NODE(it)   (_ITER_BASE (it)._C_node)</span></div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span> </div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>_EXPORT</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="keyword">class </span>bc___rb_tree : <span class="keyword">private</span> _Alloc</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>{</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    </div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    <span class="keyword">typedef</span>  bc___rw_rb_tree_node&lt;_Alloc,_Val,_Key,_KeyOf&gt; _C_node_t; </div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="keyword">typedef</span> _RWSTD_ALLOC_TYPE (_Alloc,_Val)            _C_val_alloc_t;</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="keyword">typedef</span> _RWSTD_REBIND (_Alloc, _Key)               _C_key_alloc_t;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keyword">typedef</span> _RWSTD_REBIND (_Alloc, _C_node_t)          _C_node_alloc_t;</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_alloc_t::pointer         _C_link_t;</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    </div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="keyword">typedef</span> _Key                                       key_type;</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="keyword">typedef</span> _Val                                       value_type;</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    <span class="keyword">typedef</span> _Comp                                      key_compare;</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    <span class="keyword">typedef</span> _Alloc                                     allocator_type;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>      </div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_val_alloc_t::pointer          pointer;</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_val_alloc_t::const_pointer    const_pointer;</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> allocator_type::size_type        size_type;</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> allocator_type::difference_type  difference_type;</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_val_alloc_t::reference        reference;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_val_alloc_t::const_reference  const_reference;</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    </div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="keyword">typedef</span> bc___rw_tree_iter&lt;value_type, difference_type, pointer,</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>                              reference, _C_node_t&gt;        _C_tree_iter;</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    <span class="keyword">typedef</span> bc___rw_tree_iter&lt;value_type, difference_type, const_pointer,</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>                              const_reference, _C_node_t&gt;  _C_tree_citer;</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span> </div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span><span class="preprocessor">#ifndef _RWSTD_NO_DEBUG_ITER</span></div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    <span class="keyword">typedef</span> __rw_debug_iter &lt;bc___rb_tree, _C_tree_iter, _C_tree_iter&gt;</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    iterator;</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    <span class="keyword">typedef</span> __rw_debug_iter &lt;bc___rb_tree, _C_tree_citer, _C_tree_iter&gt;</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    const_iterator;</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span> </div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    iterator _C_make_iter (_C_link_t __node) {</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        <span class="keywordflow">return</span> iterator (*<span class="keyword">this</span>, _C_tree_iter (__node));</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    }</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    const_iterator _C_make_iter (_C_link_t __node)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        <span class="keywordflow">return</span> const_iterator (*<span class="keyword">this</span>, _C_tree_citer (__node));</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    }</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span> </div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="preprocessor">#else   </span><span class="comment">// if defined (_RWSTD_NO_DEBUG_ITER)</span></div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    <span class="keyword">typedef</span> _C_tree_iter         iterator;</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="keyword">typedef</span> _C_tree_citer        const_iterator;</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    iterator _C_make_iter (_C_link_t __node) {</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="keywordflow">return</span> iterator (__node);</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    }</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    const_iterator _C_make_iter (_C_link_t __node)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        <span class="keywordflow">return</span> const_iterator (__node);</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    }</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span> </div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_DEBUG_ITER</span></div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span> </div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span><span class="preprocessor">#ifdef _RWSTD_NO_NESTED_CLASS_ACCESS</span></div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    <span class="comment">// allow _C_node_buf access to bc___rb_tree&#39;s private type(s)</span></div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    <span class="comment">// if the resolution of cwg issue 45 is not yet implemented</span></div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="keyword">struct </span>_C_node_buf;</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    <span class="keyword">friend</span> <span class="keyword">struct </span>_C_node_buf;</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    </div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_NESTED_CLASS_ACCESS</span></div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    <span class="keyword">struct </span>_C_node_buf {</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>        <span class="keyword">typedef</span> _RWSTD_REBIND (allocator_type, _C_node_buf) _C_buf_alloc_t;</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_buf_alloc_t::pointer           _C_buf_ptr_t;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>        </div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>        _C_buf_ptr_t _C_next_buffer;</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>        size_type    size;</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        _C_link_t    _C_buffer;</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    };</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span> </div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_buf::_C_buf_alloc_t _C_buf_alloc_t;</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> _C_node_buf::_C_buf_ptr_t   _C_buf_ptr_t;</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span> </div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    _C_buf_ptr_t _C_buf_list;</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    _C_link_t    _C_free_list;</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    _C_link_t    _C_next_avail;</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    _C_link_t    _C_last;</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    </div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    <span class="keywordtype">void</span> _C_add_new_buffer ();</div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <span class="keywordtype">void</span> _C_deallocate_buffers ();</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    </div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    <span class="comment">// </span></div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    <span class="comment">// Return a node from the free list or new storage</span></div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    <span class="comment">//</span></div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    _C_link_t _C_get_link () {</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        _C_link_t __tmp = _C_free_list;</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        _C_link_t __tmp2 = (<span class="keywordtype">void</span>*)_C_free_list ? </div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>            (_C_free_list = _RWSTD_STATIC_CAST (_C_link_t,(_C_free_list-&gt;_C_child [1])), __tmp) </div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>            : (_C_next_avail == _C_last ? (_C_add_new_buffer (), _C_next_avail++) </div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>               : _C_next_avail++);</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        __tmp2-&gt;_C_parent    = 0;</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>        __tmp2-&gt;_C_child [0] = 0;</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        __tmp2-&gt;_C_child [1] = 0;</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>        __tmp2-&gt;_C_color     = _C_node_t::_C_red;</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>        <span class="keywordflow">return</span> __tmp2;</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    }</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span> </div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    <span class="comment">//</span></div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    <span class="comment">// Return a node from the free list or new storage with</span></div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <span class="comment">// the _Val __v constructed on it.  Every call to _C_get_node</span></div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    <span class="comment">// must eventually be followed by a call to _C_put_node.</span></div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    <span class="comment">//</span></div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>    _C_link_t _C_get_node (const_reference __v) {</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>        _C_link_t __tmp2 = _C_get_link ();</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>        BC__TRY {</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>            _RWSTD_VALUE_ALLOC (_C_val_alloc_t, *<span class="keyword">this</span>,</div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>                 construct (_RWSTD_VALUE_ALLOC (_C_val_alloc_t, *<span class="keyword">this</span>,</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>                                                address (__tmp2-&gt;_C_value)),</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>                            __v));</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>        }</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>        BC__CATCH (...) {</div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>            _C_put_node (__tmp2, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>            BC__RETHROW;</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        }      </div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>        <span class="keywordflow">return</span> __tmp2;</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    }</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span> </div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    _C_link_t _C_get_node () {</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        <span class="keywordflow">return</span> _C_get_link ();</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    }</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    </div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    <span class="comment">// </span></div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    <span class="comment">// Return a node to the free list and destroy the value in it.</span></div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    <span class="comment">//</span></div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    <span class="keywordtype">void</span> _C_put_node (_C_link_t __p, <span class="keywordtype">bool</span> __destroy = <span class="keyword">true</span>) { </div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>        __p-&gt;_C_child [1] = _C_free_list; </div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>        <span class="keywordflow">if</span> (__destroy)  {</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>            _RWSTD_VALUE_ALLOC (_C_val_alloc_t, *<span class="keyword">this</span>,</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>                destroy (_RWSTD_VALUE_ALLOC (_C_val_alloc_t, *<span class="keyword">this</span>,</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>                    address (__p-&gt;_C_value))));</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>        }</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>        _C_free_list = __p; </div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    }</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    </div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span> </div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    <span class="comment">// _C_end is end()</span></div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    <span class="comment">// tree root is _C_end-&gt;_C_parent</span></div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="comment">// the leftmost node, i.e., begin(), is _C_end-&gt;_C_child [0]</span></div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="comment">// the rightmost node, i.e., end() - 1, is _C_end-&gt;_C_child [1]</span></div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    <span class="comment">// all three pointers are null (0) when the tree is empty</span></div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <span class="comment">// both child pointers of each leaf node are null (0)</span></div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    <span class="comment">// the parent pointer of the root node points to *_C_end</span></div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    _C_link_t _C_end;</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span> </div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    size_type   _C_size;  <span class="comment">// number of nodes</span></div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>    key_compare _C_cmp;   <span class="comment">// comparison object</span></div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span> </div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    </div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span> </div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span><span class="preprocessor">#ifndef _RWSTD_NO_CLASS_PARTIAL_SPEC</span></div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span> </div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>    <span class="keyword">typedef</span> std::reverse_iterator&lt;const_iterator&gt; const_reverse_iterator;</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>    <span class="keyword">typedef</span> std::reverse_iterator&lt;iterator&gt;       reverse_iterator;</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="preprocessor">#else   </span><span class="comment">// if defined (_RWSTD_NO_CLASS_PARTIAL_SPEC)</span></div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span> </div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  <span class="keyword">typedef</span> std::reverse_iterator&lt;const_iterator, </div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>        std::bidirectional_iterator_tag, value_type, </div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>        const_reference, const_pointer, difference_type&gt;</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    const_reverse_iterator;</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    <span class="keyword">typedef</span> std::reverse_iterator&lt;iterator, </div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>        std::bidirectional_iterator_tag, value_type, </div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>        reference, pointer, difference_type&gt;</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>    reverse_iterator;</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span> </div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_CLASS_PARTIAL_SPEC</span></div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span> </div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span> </div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    iterator _C_insert (_C_link_t, _C_link_t, <span class="keyword">const</span> value_type&amp;);</div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span> </div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    _C_link_t _C_copy (_C_link_t, _C_link_t);</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span> </div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    <span class="keywordtype">void</span> _C_erase (_C_link_t);</div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span> </div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    <span class="keywordtype">void</span> _C_erase_leaf (_C_link_t);</div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span> </div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    <span class="keywordtype">void</span> _C_init () {</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>      _C_buf_list          = 0;</div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>      _C_free_list         =</div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>      _C_next_avail        =</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>       _C_last             = 0;</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>      _C_end               = _C_get_node ();</div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>      _C_end-&gt;_C_parent    = 0;</div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>      _C_end-&gt;_C_child [0] =</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>      _C_end-&gt;_C_child [1] = _C_end;</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>    }</div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span> </div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span> </div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    bc___rb_tree (<span class="keyword">const</span> key_compare&amp; = key_compare (),</div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>               <span class="keyword">const</span> allocator_type&amp; = allocator_type ());</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> _InputIter&gt;</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    bc___rb_tree (_InputIter __first, _InputIter __last,</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>               <span class="keyword">const</span> key_compare &amp;__cmp,</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>               <span class="keyword">const</span> allocator_type &amp;__alloc, <span class="keywordtype">bool</span> __dup)</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>        : allocator_type (__alloc), _C_buf_list (0),</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>          _C_end (0), _C_size (0), </div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>          _C_cmp (__cmp) { </div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        _C_init ();</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span> </div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        BC__TRY {</div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>            insert (__first, __last, __dup);</div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>        }</div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>        BC__CATCH (...) {</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>            _C_deallocate_buffers ();</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>            BC__RETHROW;</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>        }</div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>    }</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> </div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>    bc___rb_tree (<span class="keyword">const</span> bc___rb_tree&amp;);</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span> </div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>    ~bc___rb_tree ();</div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span> </div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>    bc___rb_tree&amp; operator= (<span class="keyword">const</span> bc___rb_tree&amp;);</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span> </div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>    key_compare key_comp ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>        <span class="keywordflow">return</span> _C_cmp;</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    }</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>    _C_val_alloc_t get_allocator ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>        <span class="keywordflow">return</span> _C_val_alloc_t (*<span class="keyword">this</span>);</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    }</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span> </div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    iterator begin () {</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>        <span class="keywordflow">return</span> _C_make_iter (_C_end-&gt;_C_child [0]);</div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>    }</div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span> </div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>    const_iterator begin ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>        <span class="keywordflow">return</span> _C_make_iter (_C_end-&gt;_C_child [0]);</div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>    }</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span> </div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>    iterator end () {</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>        <span class="keywordflow">return</span> _C_make_iter (_C_end);</div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>    }</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span> </div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>    const_iterator end ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>        <span class="keywordflow">return</span> _C_make_iter (_C_end);</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>    }</div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span> </div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>    reverse_iterator rbegin () { </div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>        <span class="keywordflow">return</span> reverse_iterator (end ());</div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>    }</div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>    </div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>    reverse_iterator rend () { </div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>        <span class="keywordflow">return</span> reverse_iterator (begin ());</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>    } </div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span> </div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>    const_reverse_iterator rbegin ()<span class="keyword"> const </span>{ </div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>        <span class="keywordflow">return</span> const_reverse_iterator (end ());</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    }</div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    </div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    const_reverse_iterator rend ()<span class="keyword"> const </span>{ </div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>        <span class="keywordflow">return</span> const_reverse_iterator (begin ());</div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    } </div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span> </div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>    <span class="keywordtype">bool</span> empty ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>        <span class="keywordflow">return</span> 0 == _C_size;</div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>    }</div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span> </div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    size_type size ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>        <span class="keywordflow">return</span> _C_size;</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    }</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span> </div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>    size_type max_size ()<span class="keyword"> const </span>{ </div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>      <span class="keywordflow">return</span> _C_node_alloc_t (*this).max_size (); </div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>    }</div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>    </div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>    <span class="keywordtype">void</span> swap (bc___rb_tree &amp;__rhs) {</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>      <span class="keywordflow">if</span> (get_allocator () == __rhs.get_allocator ()) {</div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>          std::swap (_C_buf_list, __rhs._C_buf_list);</div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>          std::swap (_C_free_list, __rhs._C_free_list);</div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>          std::swap (_C_next_avail, __rhs._C_next_avail);</div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>          std::swap (_C_last, __rhs._C_last);</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>          std::swap (_C_end, __rhs._C_end);</div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>          std::swap (_C_size, __rhs._C_size);</div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>          std::swap (_C_cmp, __rhs._C_cmp);</div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>      }</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>      <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>          bc___rb_tree __tmp = *<span class="keyword">this</span>;</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>          *<span class="keyword">this</span> = __rhs;</div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>          __rhs = __tmp;</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>      } </div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>    }</div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span> </div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>    <span class="keywordtype">void</span> _C_insert (<span class="keyword">const</span> value_type&amp;, ATEC::xpair&lt;iterator, bool&gt;&amp;, <span class="keywordtype">bool</span>);</div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span> </div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>    ATEC::xpair&lt;iterator, bool&gt;</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>    insert (<span class="keyword">const</span> value_type &amp;__val, <span class="keywordtype">bool</span> __dup) {</div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>        ATEC::xpair&lt;iterator, bool&gt; __ret;</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>        <span class="keywordflow">return</span> _C_insert (__val, __ret, __dup), __ret;</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>    }</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span> </div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>    iterator insert (iterator, <span class="keyword">const</span> value_type&amp;, <span class="keywordtype">bool</span>);</div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span> </div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> _Iterator&gt;</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>    <span class="keywordtype">void</span> insert (_Iterator __first, _Iterator __last, <span class="keywordtype">bool</span> __dup) {</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>        <span class="keywordflow">for</span> (; __first != __last; ++__first)</div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>            insert (*__first, __dup);</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>    }</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span> </div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>    iterator erase (iterator);</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span> </div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>    size_type erase (<span class="keyword">const</span> key_type&amp;);</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span> </div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>    iterator erase (iterator, iterator);</div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span> </div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="comment">// MSVC 6.0 thinks S&lt;const T*&gt; is the same as S&lt;T*&gt;...</span></div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="preprocessor">#if !defined (_MSC_VER) || _MSC_VER &gt; 1300</span></div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span> </div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>    <span class="comment">// map and set&#39;s iterator may be defined to be tree::const_iterator</span></div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>    iterator insert (const_iterator __it, <span class="keyword">const</span> value_type &amp;__x, <span class="keywordtype">bool</span> __dup) {</div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>        <span class="keywordflow">return</span> insert (_C_make_iter (_ITER_NODE (__it)), __x, __dup);</div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>    }</div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span> </div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>    <span class="comment">// map and set&#39;s iterator may be defined to be tree::const_iterator</span></div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    iterator erase (const_iterator __it) {</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>        <span class="keywordflow">return</span> erase (_C_make_iter (_ITER_NODE (__it)));</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>    }</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span> </div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    <span class="comment">// map and set&#39;s iterator may be defined to be tree::const_iterator</span></div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>    iterator erase (const_iterator __first, const_iterator __last) {</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>        <span class="keywordflow">return</span> erase (_C_make_iter (_ITER_NODE (__first)),</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>                      _C_make_iter (_ITER_NODE (__last)));</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    }</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span> </div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span><span class="preprocessor">#endif   </span><span class="comment">// _MSC_VER &lt;= 1300</span></div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span> </div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>    <span class="keywordtype">void</span> erase (<span class="keyword">const</span> key_type*, <span class="keyword">const</span> key_type*);</div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span> </div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>    <span class="keywordtype">void</span> clear () {</div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>        erase (begin (), end ());</div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>    }</div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span> </div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>    iterator find (<span class="keyword">const</span> key_type&amp;);</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span> </div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>    const_iterator find (<span class="keyword">const</span> key_type&amp; __key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>        <span class="keywordflow">return</span> _RWSTD_CONST_CAST (bc___rb_tree*, <span class="keyword">this</span>)-&gt;find (__key);</div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>    }</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span> </div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>    size_type count (<span class="keyword">const</span> key_type&amp;) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span> </div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>    iterator lower_bound (<span class="keyword">const</span> key_type&amp;);</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span> </div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    const_iterator lower_bound (<span class="keyword">const</span> key_type&amp; __key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>        <span class="keywordflow">return</span> _RWSTD_CONST_CAST (bc___rb_tree*, <span class="keyword">this</span>)-&gt;lower_bound (__key);</div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>    }</div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span> </div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>    iterator upper_bound (<span class="keyword">const</span> key_type&amp;);</div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span> </div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>    const_iterator upper_bound (<span class="keyword">const</span> key_type&amp; __key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>        <span class="keywordflow">return</span> _RWSTD_CONST_CAST (bc___rb_tree*, <span class="keyword">this</span>)-&gt;upper_bound (__key);</div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>    }</div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span> </div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>    ATEC::xpair&lt;iterator, iterator&gt; equal_range (<span class="keyword">const</span> key_type&amp;);</div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span> </div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>    ATEC::xpair&lt;const_iterator, const_iterator&gt;</div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>    equal_range (<span class="keyword">const</span> key_type&amp; __key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>        ATEC::xpair&lt;iterator, iterator&gt; __tmp =</div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>            _RWSTD_CONST_CAST (bc___rb_tree*, <span class="keyword">this</span>)-&gt;equal_range (__key);</div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>        <span class="keywordflow">return</span> ATEC::xpair&lt;const_iterator, const_iterator&gt;</div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>            (__tmp.first, __tmp.second);</div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    }</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span> </div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span><span class="preprocessor">#ifndef _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span> </div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>    <span class="keywordtype">void</span> _C_rol (_C_link_t);</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>    <span class="keywordtype">void</span> _C_ror (_C_link_t);</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span> </div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span><span class="preprocessor">#else   </span><span class="comment">// if defined (_RWSTD_NO_OPTIMIZE_SPEED)</span></div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span> </div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>    <span class="keywordtype">void</span> _C_rotate  (_C_link_t, <span class="keywordtype">bool</span>);</div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span> </div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span> </div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>    size_type _C_level (const_iterator) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span> </div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>    <span class="comment">// depth guaranteed to be &lt;= 2 * log2(size() + 1)</span></div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    size_type _C_depth (const_iterator, size_type* = 0) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span> </div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>    size_type _C_depth ()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>        <span class="keywordflow">return</span> _C_depth (_C_make_iter (_C_end-&gt;_C_parent));</div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    }</div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>};</div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span> </div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span> </div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span><span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span>operator== (<span class="keyword">const</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;&amp; __lhs,</div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>            <span class="keyword">const</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;&amp; __rhs)</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>{</div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>    <span class="keywordflow">return</span>    __lhs.size () == __rhs.size ()</div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>           &amp;&amp; std::equal (__lhs.begin (), __lhs.end (), __rhs.begin ());</div>
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>}</div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span> </div>
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span> </div>
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>operator&lt; (<span class="keyword">const</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;&amp; __lhs,</div>
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>           <span class="keyword">const</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;&amp; __rhs)</div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>{</div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>    <span class="keywordflow">return</span> std::lexicographical_compare (__lhs.begin (), __lhs.end (),</div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>                                          __rhs.begin (), __rhs.end ());</div>
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>}</div>
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span> </div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span> </div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key,<span class="keyword">class</span> _Val,<span class="keyword">class</span> _KeyOf,<span class="keyword">class</span> _Comp,<span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span><span class="keyword">inline</span> <span class="keywordtype">void</span>   </div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>_C_erase_leaf (_C_link_t __lnk)</div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>{</div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>    <span class="comment">// remove a leaf node from the tree</span></div>
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>    <span class="keyword">const</span> _C_link_t __parent = __lnk-&gt;_C_parent;</div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span> </div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>    <span class="keywordflow">if</span> (__parent == _C_end) {</div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>        _C_end-&gt;_C_parent    = 0;</div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>        _C_end-&gt;_C_child [0] =</div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>        _C_end-&gt;_C_child [1] = __parent;</div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>    }</div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span> </div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span><span class="preprocessor">#ifndef _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span> </div>
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span>    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__parent-&gt;_C_child [0] == __lnk) {</div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>        __parent-&gt;_C_child [0] = 0;</div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>        <span class="keywordflow">if</span> (_C_end-&gt;_C_child [0] == __lnk)</div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>            _C_end-&gt;_C_child [0] = __parent;</div>
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>    }</div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>    <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>        __parent-&gt;_C_child [1] = 0;</div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>        <span class="keywordflow">if</span> (_C_end-&gt;_C_child [1] == __lnk)</div>
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>            _C_end-&gt;_C_child [1] = __parent;</div>
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>    }</div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span> </div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span><span class="preprocessor">#else   </span><span class="comment">// if !defined (_RWSTD_NO_OPTIMIZE_SPEED)</span></div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span> </div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>    <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> __right = __parent-&gt;_C_child [0] != __lnk;</div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>        __parent-&gt;_C_child [__right] = 0;</div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>        <span class="keywordflow">if</span> (_C_end-&gt;_C_child [__right] == __lnk)</div>
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>            _C_end-&gt;_C_child [__right] = __parent;</div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>    }</div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span> </div>
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>}</div>
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span> </div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span> </div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span><span class="preprocessor">#ifndef _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span> </div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span><span class="keyword">inline</span> <span class="keywordtype">void</span> </div>
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>_C_rol (_C_link_t __lnk)</div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>{</div>
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    _RWSTD_ASSERT (_C_link_t () != __lnk);</div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span> </div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>    _C_link_t __tmp = __lnk-&gt;_C_child [1];</div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>    __lnk-&gt;_C_child [1] = __tmp-&gt;_C_child [0];</div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span> </div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span>    <span class="keywordflow">if</span> (_C_link_t () != __tmp-&gt;_C_child [0])</div>
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>        __tmp-&gt;_C_child [0]-&gt;_C_parent = __lnk;</div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span> </div>
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>    __tmp-&gt;_C_parent = __lnk-&gt;_C_parent;</div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span> </div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>    <span class="keywordflow">if</span> (__lnk == _C_end-&gt;_C_parent)</div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>        _C_end-&gt;_C_parent = __tmp;</div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__lnk == __lnk-&gt;_C_parent-&gt;_C_child [0])</div>
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>        __lnk-&gt;_C_parent-&gt;_C_child [0] = __tmp;</div>
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span>    <span class="keywordflow">else</span></div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>        __lnk-&gt;_C_parent-&gt;_C_child [1] = __tmp;</div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span> </div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>    __tmp-&gt;_C_child [0] = __lnk;</div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>    __lnk-&gt;_C_parent    = __tmp;</div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>}</div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span> </div>
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span> </div>
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span><span class="keyword">inline</span> <span class="keywordtype">void</span> </div>
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>_C_ror (_C_link_t __lnk)</div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>{</div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>    _RWSTD_ASSERT (_C_link_t () != __lnk);</div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>      </div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>    _C_link_t __tmp = __lnk-&gt;_C_child [0];</div>
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>    __lnk-&gt;_C_child [0] = __tmp-&gt;_C_child [1];</div>
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span> </div>
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>    <span class="keywordflow">if</span> (_C_link_t () != __tmp-&gt;_C_child [1])</div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>        __tmp-&gt;_C_child [1]-&gt;_C_parent = __lnk;</div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span> </div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>    __tmp-&gt;_C_parent = __lnk-&gt;_C_parent;</div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>    </div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span>    <span class="keywordflow">if</span> (__lnk == _C_end-&gt;_C_parent)</div>
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>        _C_end-&gt;_C_parent = __tmp;</div>
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__lnk == __lnk-&gt;_C_parent-&gt;_C_child [1])</div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>        __lnk-&gt;_C_parent-&gt;_C_child [1] = __tmp;</div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>    <span class="keywordflow">else</span></div>
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>        __lnk-&gt;_C_parent-&gt;_C_child [0] = __tmp;</div>
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span> </div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>    __tmp-&gt;_C_child [1] = __lnk;</div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>    __lnk-&gt;_C_parent    = __tmp;</div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>}</div>
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span> </div>
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span><span class="preprocessor">#else   </span><span class="comment">// if defined (_RWSTD_NO_OPTIMIZE_SPEED)</span></div>
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span> </div>
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span><span class="keyword">inline</span> <span class="keywordtype">void</span> </div>
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>_C_rotate (_C_link_t __lnk, <span class="keywordtype">bool</span> __right)</div>
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>{</div>
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>    _RWSTD_ASSERT (_C_link_t () != __lnk);</div>
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span> </div>
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>    _C_link_t __tmp = __lnk-&gt;_C_child [!__right];</div>
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span>    __lnk-&gt;_C_child [!__right] = __tmp-&gt;_C_child [__right];</div>
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span> </div>
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span>    <span class="keywordflow">if</span> (_C_link_t () != __tmp-&gt;_C_child [__right])</div>
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>        __tmp-&gt;_C_child [__right]-&gt;_C_parent = __lnk;</div>
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span> </div>
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>    __tmp-&gt;_C_parent = __lnk-&gt;_C_parent;</div>
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span> </div>
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>    <span class="keywordflow">if</span> (__lnk == _C_end-&gt;_C_parent)</div>
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>        _C_end-&gt;_C_parent = __tmp;</div>
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span>    <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> __rt = __lnk == __lnk-&gt;_C_parent-&gt;_C_child [1];</div>
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>        __lnk-&gt;_C_parent-&gt;_C_child [__rt] = __tmp;</div>
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>    }</div>
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span> </div>
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>    __tmp-&gt;_C_child [__right] = __lnk;</div>
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span>    __lnk-&gt;_C_parent          = __tmp;</div>
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span>}</div>
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span> </div>
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_NO_OPTIMIZE_SPEED</span></div>
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span> </div>
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span> </div>
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span><span class="keyword">inline</span> <span class="keywordtype">void</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>erase (<span class="keyword">const</span> _Key* __first, <span class="keyword">const</span> _Key* __last)</div>
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>{</div>
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span>    <span class="keywordflow">for</span> (; __first != __last; ++__first)</div>
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span>        erase (*__first);</div>
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span>}</div>
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span> </div>
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span> </div>
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span><span class="keyword">inline</span> <span class="keyword">typename</span> bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::size_type </div>
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>count (<span class="keyword">const</span> _Key&amp; __k)<span class="keyword"> const</span></div>
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span>    ATEC::xpair&lt;const_iterator, const_iterator&gt; __p = equal_range (__k);</div>
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span>    size_type __n = BC__DISTANCE (__p.first, __p.second, size_type);</div>
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>    <span class="keywordflow">return</span> __n;</div>
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span>}</div>
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span> </div>
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span> </div>
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span><span class="preprocessor">#define _RWSTD_RB_TREE_ITER \</span></div>
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span><span class="preprocessor">        typename bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::iterator</span></div>
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>                                               </div>
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Val, <span class="keyword">class</span> _KeyOf, <span class="keyword">class</span> _Comp, <span class="keyword">class</span> _Alloc&gt;</div>
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span><span class="keyword">inline</span> ATEC::xpair&lt;_RWSTD_RB_TREE_ITER , _RWSTD_RB_TREE_ITER &gt;</div>
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>bc___rb_tree&lt;_Key, _Val, _KeyOf, _Comp, _Alloc&gt;::</div>
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span>equal_range (<span class="keyword">const</span> _Key&amp; __k)</div>
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span>{</div>
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span>    <span class="keywordflow">return</span> ATEC::xpair&lt;iterator, iterator&gt;(lower_bound (__k), upper_bound(__k));</div>
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span>}</div>
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span> </div>
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span> </div>
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span><span class="preprocessor">#undef _RWSTD_RB_TREE_ITER</span></div>
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span> </div>
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span> </div>
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span>}   <span class="comment">// namespace BC__RW</span></div>
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span> </div>
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span><span class="preprocessor">#ifdef _RWSTD_NO_IMPLICIT_INCLUSION</span></div>
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span> </div>
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span><span class="preprocessor">#endif   </span><span class="comment">// _RWSTD_RW_TREE_H_INCLUDED</span></div>
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span> </div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
制作者&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3
</small></address>
</body>
</html>
